Efficient Densest Subgraph Computation in Evolving Graphs Alessandro Epasto∗ Silvio Lattanzi

Source URL: www.epasto.org

• Graph theory
• Mathematics
• Spanning tree
• Dense subgraph
• Graph coloring
• Combinatorial optimization
• Routing algorithms
• Line graph
• Tree-depth

Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity ∗ Rahul Jain† Hartmut Klauck‡ Miklos Santha§ Abstract A Direct Sum Theorem holds in a model of computation, when for every probl

Source URL: www.liafa.univ-paris-diderot.fr

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Source URL: schemeworkshop.org

• Formal languages
• Computing
• Automata theory
• Models of computation
• Parsing
• Lexical analysis
• Context-free grammar
• Parse tree
• Regular expression
• Programming language implementation
• Software engineering
• Compiler construction

Poster: Differentially Private Decision Tree Learning from Distributed Data Parisa Kaghazgaran Hassan Takabi

Source URL: www.ieee-security.org

• Data privacy
• Differential privacy
• Secure multi-party computation
• Privacy
• Internet privacy
• Information privacy
• Entropy
• Secret sharing
• Data mining
• Cryptography
• Cryptographic protocols
• Formal sciences

A Temporal Logic for Hyperproperties Bernd Finkbeiner1 , Markus N. Rabe1 , and César Sánchez2,

Source URL: software.imdea.org

• Mathematics
• Linear temporal logic
• CTL*
• Interpretation
• Computation tree logic
• Kripke structure
• Well-formed formula
• Quantification
• Model theory
• Logic
• Mathematical logic
• Temporal logic

CALCULATING THE NML DISTRIBUTION FOR TREE-STRUCTURED BAYESIAN NETWORKS Hannes Wettig, Petri Kontkanen and Petri Myllym¨aki Complex Systems Computation Group (CoSCo), Helsinki Institute for Information Technology (HIIT)

Source URL: sp.cs.tut.fi

Efficient Term Size Computation for Granularity Control 1 M. Hermenegildo and P. L´ opez-Garc´ıa

Source URL: clip.dia.fi.upm.es

• Semantics
• Literal
• Tree
• Linguistics
• Grammar
• Predicate

Seminar on Sublinear Time Algorithms Lecture 5 April 21, 2010 Lecturer: Robert Krauthgamer

Source URL: www.wisdom.weizmann.ac.il

• Quantum complexity theory
• Probabilistic complexity theory
• Models of computation
• Analysis of algorithms
• Randomized algorithm
• PP
• Decision tree model
• IP
• MAX-3SAT
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Zones From infinte to finite

Source URL: www2.imm.dtu.dk

• T1
• Q
• Computer science
• Computing
• Temporal logic
• Logic in computer science
• Computation tree logic

Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2

Source URL: www.liafa.jussieu.fr

• Computational complexity theory
• Applied mathematics
• Competitive analysis
• K-server problem
• Randomized algorithm
• Metrical task system
• Adversary model
• Minimum spanning tree
• Bin packing problem
• Theoretical computer science
• Online algorithms
• Analysis of algorithms